Brief Introduction to Provable Security

نویسنده

  • Michel Abdalla
چکیده

The primary goal of cryptography is to enable parties to communicate securely over an insecure channel, which may be under the control of an adversary. Though originally used mainly for the purpose of protecting the privacy of messages, cryptography now encompasses many other goals, such as guaranteeing the integrity of messages being exchanged or the authenticity of the sender. For most of its history, cryptography was essentially a game played between designers and attackers in which one side would try to outsmart the other by conceiving ad hoc attack and defense mechanisms for their particular goals [Bel11]. Although this ad hoc aspect may always be present in the field, cryptography has since become a well established science, with clear security definitions and objectives. The exact security objectives in which one might be interested will be determined by the application one has in mind and may depend on many factors, such as how powerful adversaries may be or the type of information that needs to be protected. The two most common goals usually considered are data privacy and authenticity. While the goal of data privacy is to keep unintended parties from learning the contents of the message being sent over the channel, data authenticity aims at guaranteeing that the contents of the message have not been tampered with during the course of transmission.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Information-theoretic Cryptography

In 1949, Shannon published the paper ”Communication theory of secrecy systems”. This constituted a foundational treatment and analysis of encryption systems. He transferred the methods of information theory, originally developed as a mathematical model for communication over ”noisy” channels to the setting of cryptosystems. We give a brief introduction into his most outstanding ideas, such as t...

متن کامل

Sequences of games: a tool for taming complexity in security proofs

This paper is brief tutorial on a technique for structuring security proofs as sequences games.

متن کامل

Provable Security Proofs and their Interpretation in the Real World

This paper analyses provable security proofs, using the EDL signature scheme as its case study, and interprets their benefits and drawbacks when applied to the real world. Provable security has been an area of contention. Some, such as Koblitz and Menezes, give little credit to the potential extra security provided and argue that it is a distracting goal. However, others believe that an algorit...

متن کامل

Making An Empty Promise With A Quantum Computer (Or, A Brief Review on the Impossibility of Quantum Bit Commitment)

The desire to obtain an unconditionally secure bit commitment protocol in quantum cryptography was expressed for the rst time thirteen years ago. Bit commitment is suucient in quantum cryptography to realize a variety of applications with unconditional security. In 1993, a quantum bit commitment protocol was proposed together with a security proof. However, a basic aw in the protocol was discov...

متن کامل

A brief review on the impossibility of quantum bit commitment

The desire to obtain an unconditionally secure bit commitment protocol in quantum cryptography was expressed for the first time thirteen years ago. Bit commitment is sufficient in quantum cryptography to realize a variety of applications with unconditional security. In 1993, a quantum bit commitment protocol was proposed together with a security proof. However, a basic flaw in the protocol was ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014